Polyhedral Methods in Discrete Optimization
نویسندگان
چکیده
In the last decade our capability of solving integer programming problems has increased dramatically due to the effectiveness of cutting plane methods based on polyhedral investigations. Polyhedral cutting planes have become central features in optimization software packages for integer programming. Here we present some of the important polyhedral methods used in discrete optimization. We discuss applications to knapsack problems and robust combinatorial optimization. (AMS Lectures on Trends in Optimization)
منابع مشابه
Polyhedral methods for piecewise-linear functions I: the lambda method
The \lambda method" is a well-known method for using integer linear-programming methods to model separable piecewise-linear functions in the context of optimization formulations. We extend the lambda method to the nonseparable case, and use polyhedral methods to strengthen the formulation.
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملA new polyhedral approach to combinatorial designs
A New Polyhedral Approach to Combinatorial Designs. (May 2004) Ivette Arámbula Mercado, B.S., Tecnológico de Monterrey (ITESM); M.S., Tecnológico de Monterrey (ITESM) Chair of Advisory Committee: Dr. Illya V. Hicks We consider combinatorial t-design problems as discrete optimization problems. Our motivation is that only a few studies have been done on the use of exact optimization techniques in...
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کاملRobust portfolio selection with polyhedral ambiguous inputs
Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...
متن کامل